Disjunction and existence properties in modal arithmetic
نویسندگان
چکیده
Abstract We systematically study several versions of the disjunction and existence properties in modal arithmetic. First, we newly introduce three classes $\mathrm {B}$ , $\Delta (\mathrm {B})$ $\Sigma formulas arithmetic basic them. Then, prove implications between properties. In particular, among other things, that for any consistent recursively enumerable extension T $\mathbf {PA}(\mathbf {K})$ with $T \nvdash \Box \bot $ -disjunction property, -existence property are pairwise equivalent. Moreover, notion -soundness theories {K4})$ is equivalent to -soundness.
منابع مشابه
Disjunction in Modal Description Logics
We investigate the complexity of satisfaction problems in modal description logics without disjunction between formulae. It is shown that simulation of disjunction in the class of all models of these logics is possible, so that the complexity remains same no matter the logics is with or without disjunction of formulae. However, the omission of disjunction, in the class of the models based on th...
متن کاملFactoring Disjunction Out of Deontic Modal Puzzles
Ross’s puzzle (Ross, 1941) and the paradox of Free Choice Permission (Kamp, 1973), puzzles involving disjunction under deontic operators, have received wide discussion in recent work in natural language semantics. First, I contrast the opposed modal views—call them the “box-diamond” theory and EU theory—that form two poles of the contemporary debate. The opposition between them is underwritten ...
متن کاملFeasible Disjunction Property and Feasible Interpolation in Modal Logic
We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeš’ obtained in [9].
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملCZF has the Disjunction and Numerical Existence Property
This paper proves that the disjunction property, the numerical existence property and Church’s rule hold true for Constructive Zermelo-Fraenkel Set Theory, CZF, and also for the theory CZF augmented by the Regular Extension Axiom. As to the proof technique, it features a self-validating semantics for CZF that combines extensional Kleene realizability and truth. MSC:03F50, 03F35
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Symbolic Logic
سال: 2022
ISSN: ['1755-0211', '1755-0203']
DOI: https://doi.org/10.1017/s1755020322000363